Hybrid Algorithm for Improving Efficiency of Keywords based Search Engine
نویسندگان
چکیده
منابع مشابه
A Search Engine Technique Using Relation Based Keywords
Abstract — With the growing complexity of online information, the search results in keyword based search engines are growing increasingly vague and cumbersome. Less efforts on behalf of the search engines result in more painstaking effort for the user to find the best pages. This paper describes a framework where the disadvantages of keyword based search engines are removed by presenting to the...
متن کاملKeywordVis: Identifying and Analyzing Keywords for Search Engine Advertising
Medium-small advertisers need to find profitable keywords when they set up search engine advertising campaign for their domains. Most of the existing ads keyword research tools are either visualizing keywords with inadequate data or just showing a big table of numbers without visualization, thus users can not effectively discover the keywords which can reach their target users. We design and im...
متن کاملClustering of Search Engine Keywords Using Access Logs
It the becomes possible that users can get kinds of information by just inputting search keyword(s) representing the topic which users are interested in. But it is not always true that users can hit upon search keyword(s) properly. In this paper, by using Web access logs (called panel logs), which are collected URL histories of Japanese users (called panels) selected without static deviation si...
متن کاملImproving the Search for Learning Objects with Keywords and Ontologies
We report on an ongoing project which aims at improving the e ectiveness of retrieval and accessibility of learning object within learning management systems and learning object repositories. The project Language Technology for eLearning approaches this task by providing Language Technology based functionalities and by integrating semantic knowledge through domain-speci c ontologies. We will re...
متن کاملImproving Search Engine For A Digital Library
This project introduces a novel approach for using click through data to discover clusters of similar queries and similar URLs. One can simply observe that users reformulate their queries to find a desirable result. We define this sequence of queries as a query chain. Our data set consists of records containing user id, query term, query date and time, clicked item URL and clicked item rank if ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Computer Science and Informatics
سال: 2012
ISSN: 2231-5292
DOI: 10.47893/ijcsi.2012.1051